全文获取类型
收费全文 | 9244篇 |
免费 | 1168篇 |
国内免费 | 362篇 |
专业分类
化学 | 988篇 |
晶体学 | 14篇 |
力学 | 1038篇 |
综合类 | 389篇 |
数学 | 5656篇 |
物理学 | 2689篇 |
出版年
2024年 | 14篇 |
2023年 | 87篇 |
2022年 | 224篇 |
2021年 | 283篇 |
2020年 | 204篇 |
2019年 | 202篇 |
2018年 | 229篇 |
2017年 | 338篇 |
2016年 | 457篇 |
2015年 | 302篇 |
2014年 | 556篇 |
2013年 | 621篇 |
2012年 | 507篇 |
2011年 | 557篇 |
2010年 | 451篇 |
2009年 | 581篇 |
2008年 | 604篇 |
2007年 | 625篇 |
2006年 | 502篇 |
2005年 | 461篇 |
2004年 | 405篇 |
2003年 | 343篇 |
2002年 | 319篇 |
2001年 | 276篇 |
2000年 | 245篇 |
1999年 | 213篇 |
1998年 | 200篇 |
1997年 | 165篇 |
1996年 | 139篇 |
1995年 | 108篇 |
1994年 | 72篇 |
1993年 | 83篇 |
1992年 | 73篇 |
1991年 | 40篇 |
1990年 | 48篇 |
1989年 | 28篇 |
1988年 | 34篇 |
1987年 | 23篇 |
1986年 | 29篇 |
1985年 | 31篇 |
1984年 | 28篇 |
1983年 | 9篇 |
1982年 | 18篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 5篇 |
1959年 | 6篇 |
1957年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 140 毫秒
51.
We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help. 相似文献
52.
戴伏生 《数学的实践与认识》2006,36(2):186-192
经典的D IJKSTRA和BELLM AN-F LOYD通信网络路由算法,只能根据特定网络参数得到最佳路由,却无法获得网络存在的全部可用路由,而通信网理论研究及网络管理等方面,往往需要获得节点之间的全部可用路由.研究出一种路由新算法,遵循逻辑代数运算规则、采用关联矩阵中行与行之间整合与删除方式计算,N个节点的网络只需N-1次整合及删除运算,就能得到源节点到任意节点两点之间全部路由结果.详细论证了算法的正确性与合理性,简介了算法的并行运算可行性及与经典路由算法的兼容性等问题.通过算例详细说明算法的计算过程,并验证其正确性. 相似文献
53.
Chen Hao 《中国科学A辑(英文版)》2006,49(5):715-720
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p
m) (any positive integer m) with the period 3n (n and p
m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura
algorithm, we can determine the linear complexity of any sequence over GF(p
m) with the period 3n (n and p
m
− 1 are coprime) more efficiently. 相似文献
54.
55.
Temperature effects on deposition rate of silicon nitride films were characterized by building a neural network prediction model. The silicon nitride films were deposited by using a plasma enhanced chemical vapor deposition system and process parameter effects were systematically characterized by 26−1 fractional factorial experiment. The process parameters involved include a radio frequency power, pressure, temperature, SiH4, N2, and NH3 flow rates. The prediction performance of generalized regression neural network was drastically improved by optimizing multi-valued training factors using a genetic algorithm. Several 3D plots were generated to investigate parameter effects at various temperatures. Predicted variations were experimentally validated. The temperature effect on the deposition rate was a complex function of parameters but N2 flow rate. Larger decreases in the deposition rate with the temperature were only noticed at lower SiH4 (or higher NH3) flow rates. Typical effects of SiH4 or NH3 flow rate were only observed at higher or lower temperatures. A comparison with the refractive index model facilitated a selective choice of either SiH4 or NH3 for process optimization. 相似文献
56.
E. Mathieu Y. Foucher P. Dellamonica J. P. Daures 《Methodology and Computing in Applied Probability》2007,9(3):389-397
In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical
taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In
this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding
the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed.
A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented
for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct
times and follow-up has an impact on the evolution of patients.
相似文献
57.
A. V. Kel’manov L. V. Mikhailova 《Computational Mathematics and Mathematical Physics》2006,46(1):165-181
The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented. 相似文献
58.
利用普通幂级数发生函数方法,通过对发生函数进行xD算子,得到和式∑k=0^nμ^kf(k)的计算公式,并计算该类和式+ 相似文献
59.
在清华大学物理系成立60周年之际,我们对近年来清华大学物理系量子信息研究的主要进展情况作一介绍,包括量子搜索算法研究,核磁共振量子计算的实验研究,量子通讯的理论与实验研究.在量子搜索算法研究方面,我们提出了量子搜索算法的相位匹配,纠正了当时的一种错误观点,并且提出了一种成功率为100%的量子搜索算法,改进了Grover算法;在核磁共振量子计算实验方面,我们实现了2到7个量子比特的多种量子算法的实验演示;在量子通讯方面,我们提出了分布式传输的量子通讯的思想,应用于量子密钥分配、量子秘密共享、量子直接安全通讯等方面,构造了多个量子通讯的理论方案.在实验室,我们实现了2米距离的空间量子密码通讯的演示实验. 相似文献
60.
Yukio Iida Masahiro Shibutani Katsuhiko Kobayashi Kazuhiko Ohnuma Yoichi Miyake Toru Noda 《Optical Review》2006,13(2):87-92
The double-pass method is thought to obtain the point spread function (PSF) in human eyes based on two techniques: the symmetric
double-pass method using the same pupil size and the asymmetric double-pass method using a different pupil size. The symmetric
double-pass method provides autocorrelation of the retinal PSF and, thus, the modulation transfer function. The asymmetric
double-pass method provides low-frequency partial-phase information and the partial phase-retrieval algorithm is applied to
obtain the complete-phase information, and to estimate the PSF. The partial phase-retrieval algorithm is based on the iteration
method proposed by Fineup and Kowalczyk and requires a lengthy computation. In this study, we propose a new high-speed phase-retrieval
algorithm based on the property that the real and imaginary parts of optical transfer functions (OTFs) continuously change
in value. 相似文献